for _ in range(int(input())):
n=int(input())
s=input()
ans='NO'
substring=n-4
for i in range(5):
if s[:i]+s[i+substring:]=='2020':
ans='YES'
break
print(ans)
#include<bits/stdc++.h>
#define ll long long
#define VL vector<ll>
const int MAX=1e4+1;
using namespace std;
void solve()
{ int n ; cin>>n;
string s;
cin>>s;
ll w=n-4;
int a[5][4]={
{0 , 1, 2, 3}, {0 , 1, 2, n-1}, {0 , 1, n-2, n-1} , {0 , n-3, n-2, n-1} , {n-4 , n-3, n-2, n-1}
};
bool f=0;
for(int i=0 ; i< 5 ; i++){
string st="";
for(int j=0 ; j< 4 ; j++){
st+=s[a[i][j]];
}
// cout<<st<<endl;
if(st=="2020"){
f=1;
break;
}
}
if(f)cout<<"YES\n";
else cout<<"NO\n";
}
int main()
{
ll t=1; cin>>t;
while(t--) solve();
return 0;
}
432A - Choosing Teams | 758A - Holiday Of Equality |
1650C - Weight of the System of Nested Segments | 1097A - Gennady and a Card Game |
248A - Cupboards | 1641A - Great Sequence |
1537A - Arithmetic Array | 1370A - Maximum GCD |
149A - Business trip | 34A - Reconnaissance 2 |
59A - Word | 462B - Appleman and Card Game |
1560C - Infinity Table | 1605C - Dominant Character |
1399A - Remove Smallest | 208A - Dubstep |
1581A - CQXYM Count Permutations | 337A - Puzzles |
495A - Digital Counter | 796A - Buying A House |
67A - Partial Teacher | 116A - Tram |
1472B - Fair Division | 1281C - Cut and Paste |
141A - Amusing Joke | 112A - Petya and Strings |
677A - Vanya and Fence | 1621A - Stable Arrangement of Rooks |
472A - Design Tutorial Learn from Math | 1368A - C+= |